Lagrangean decomposition using an improved Nelder-Mead approach for Lagrangean multiplier update

نویسندگان

  • Dan Wu
  • Marianthi G. Ierapetritou
چکیده

Lagrangean decomposition has been recognized as a promising approach for solving large-scale optimization problems. However, Lagrangean decomposition is critically dependent on the method of updating the Lagrangean multipliers used to decompose the original model. This paper presents a Lagrangean decomposition approach based on Nelder–Mead optimization algorithm to update the Lagrangean multipliers. The main advantage of the proposed approach is that it results in improved objective function values for the majority of iterations. The efficiency of the proposed approach is illustrated with examples from the literature and the solution of scheduling problems. ©

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lagrangean Heuristic Approach for the Synthesis of Multiperiod Heat Exchanger Networks

In this work, we apply a decomposition technique to address the multiperiod heat exchanger network synthesis. Each period corresponds to changes in operating conditions, i.e. inlet temperatures and heat capacity flowrates. The problem size grows quickly with the number of streams and the number of periods resulting in a large scale problem to solve. In order to reduce the problem to a manageabl...

متن کامل

A Lagrangean decomposition approach for oil supply chain investment planning under uncertainty with risk considerations

We present a scenario decomposition framework based on Lagrangean decomposition for the multi-product, multi-period, supply investment planning problem considering network design and discrete capacity expansion under demand uncertainty. We also consider a risk measure that allows us to reduce the probability of incurring in high costs while preserving the decomposable structure of the problem. ...

متن کامل

Lagrangean/surrogate relaxation for generalized assignment problems

This work presents Lagrangean/surrogate relaxation to the problem of maximum pro®t assignment of n tasks to m agents (n > m), such that each task is assigned to only one agent subject to capacity constraints on the agents. The Lagrangean/surrogate relaxation combines usual Lagrangean and surrogate relaxations relaxing ®rst a set of constraints in the surrogate way. Then, the Lagrangean relaxati...

متن کامل

Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem

Conventional Lagrangean preprocessing for the network Weight Constrained Shortest Path Problem (WCSPP), for example Beasley and Christofides [3], calculates lower bounds on the cost of using each node and edge in a feasible path using a single optimal Lagrange multiplier for the relaxation of the WCSPP. These lower bounds are used in conjunction with an upper bound to eliminate nodes and edges....

متن کامل

Lagrangean variables in infinite dimensional spaces for a dynamic economic equilibrium problem

This paper is focused on the study of a dynamic competitive equilibrium by using Lagrangean multipliers. This mathematical formulation allows us the improve theWalrasian model by considering the common possibility of an uncharged delayed payment in a given time (for example, by using a credit card). Firstly the economic equilibrium problem is reformulated as an evolutionary variational problem;...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Chemical Engineering

دوره 30  شماره 

صفحات  -

تاریخ انتشار 2006